Face Detection on Embedded Systems

Over recent years automated face detection and recognition (FDR) have gained significant attention from the commercial and research sectors. This paper presents an embedded face detection solution aimed at addressing the real-time image processing requirements within a wide range of applications. As face detection is a computationally intensive task, an embedded solution would give rise to opportunities for discrete economical devices that could be applied and integrated into a vast majority of applications. This work focuses on the use of FPGAs as the embedded prototyping technology where the thread of execution is carried out on an embedded soft-core processor. Custom instructions have been utilized as a means of applying software/hardware partitioning through which the computational bottlenecks are moved to hardware. A speedup by a factor of 110 was achieved from employing custom instructions and software optimizations

Class of algorithms for realtime subpixel registration

In 1972, Barnea and Silverman presented a new approach to the wide field of template matching, the SSD-algorithm. Further work has been done to adapt the method to gain subpixel accuracy. Intense investigation of the proposed algorithms led to our new approach: by interpolating the template instead of reference image, and by applying sort of an error-correction to the resulting subpixel-value, both computation time and accuracy can be improved. Exhaustive experiments with a CCD-camera and various kinds of reference images showed that a maximum error of 10 per cent of the pixel period can be expected. Depending on the kind of image, mean square errors range from 0.4 per cent to 4 per cent

MTI-Leitprojekt EMBASSI. Teilvorhaben: Multimodale Verknuepfung und Eyetracking Schlussbericht

SIGLEAvailable from TIB Hannover: F04B47+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Bildung und Forschung, Berlin (Germany)DEGerman

Class of algorithms for realtime subpixel registration

In 1972, Barnea and Silverman presented a new approach to the wide field of template matching, the SSD-algorithm. Further work has been done to adapt the method to gain subpixel accuracy. Intense investigation of the proposed algorithms led to our new approach: by interpolating the template instead of the reference image, and by applying sort of an error-correction to the resulting subpixel-value, both computation time and accuracy can be improved. Exhaustive experiments with a CCD-Camera and various kinds of reference images showed that a maximum error of 10% of the pixel period can be expected. Depending on the kind of image, mean square errors range from 0.4% to 4%. (orig.)SIGLEAvailable from TIB Hannover: DtF QN1(71,4) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Commentary on Social Services Inspectorate (SSI_ advice note on discretionary charges for non-residential adult social services

SIGLEAvailable from British Library Document Supply Centre-DSC:q97/16410 / BLDSC - British Library Document Supply CentreGBUnited Kingdo